Hypotheses Founded Semantics of Logic Programs for Information Integration in Multi-Valued Logics
نویسندگان
چکیده
We address the problem of integrating information coming from different sources. The information consists of facts that a central server collects and tries to combine using (a) a set of logical rules, i.e. a logic program, and (b) a hypothesis representing the server’s own estimates. In such a setting incomplete information from a source or contradictory information from different sources necessitate the use of many-valued logics in which programs can be evaluated and hypotheses can be tested. To carry out such activities we propose a formal framework based on bilattices such as Belnap’s four-valued logics. In A preliminary version of this paper appeared in the form of an extended abstract in the proceedings of the first International Conference on Theoretical Computer Science (IFIP TCS 2000) Exploring New Frontiers of Theoretical Informatics. Corresponding author. Istituto di Elaborazione della Informazione, Consiglio Nazionale delle Ricerche, Area della Ricerca CNR di Pisa, Via Moruzzi,1 I-56124 Pisa, Phone (39) 050 315 2901, Fax (39) 050 315 2810, [email protected] Laboratoire de Recherche en Informatique, UMR 8623, Université de Paris Sud, Bat. 490, 91405 Orsay, (33) 1 69 15 66 24, [email protected]. Part of this research work was conducted while this author was visiting with the Meme Media Laboratory, University of Hokkaido, Japan. Department of Computer Science, Birkbeck, University of London, Malet Street, London WC1E 7HX, UK. Phone +44-20 7631 6796, Fax +44-20 7631 6727, [email protected]. Partially supported by a Marie Curie Fellowship, EC Contract No: HPMF-CT-1999-0393
منابع مشابه
Well-Founded Inference and 3-Valued Logics
We deene a simple logical semantics based on minimal models in Lukasiewicz's 3-valued logic, L 3. On normal logic programs it is equivalent to the well-founded semantics (WFS), and on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusinski's 3-valued stable semantics. One advantage is that it is char-acterised by simple conditions on mo...
متن کاملExtended Well-Founded Semantics for Paraconsistent Logic Programs
This paper presents a declarative semantics of logic programs which possibly contain inconsistent information. We introduce a multi-valued interpretation of logic programs and present the extended well-founded semantics for paraconsistent logic programs. In this setting, a meaningful information is still available in the presence of an inconsistent information in a program and any fact which is...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملCombining First-Order Logic Knowledge Bases and Logic Programming using fol-programs
The integration of knowledge bases in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention in the context of current efforts around Semantic-Web languages. Towards this integration we introduce fol-programs, which combine logic programs under the answer set and the wellfoun...
متن کاملThree-Valued Semantics for Extended Logic Programs
In 4] , the semantics of monotonic (i.e. not-free) extended logic programs (ELPs) has been rephrased in three-valued logic for two purposes: achieving tractable reasoning with incomplete information and understanding the relationships between the existing semantics and many-valued logics. In this paper, we generalize this approach to unrestricted ELPs. We obtain a unifying view of many formalis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.LO/0111059 شماره
صفحات -
تاریخ انتشار 2001